B11 - Binary Search 2
https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_cj
提出
code: python
import bisect
n = int(input())
a = list(map(int, input().split()))
q = int(input())
x =
int(input()) for _ in range(q)
a.sort()
for v in x:
print(bisect.bisect_left(a, v))